Computer Networks A gentle introduction to queuing theory

نویسنده

  • Saad Mneimneh
چکیده

In the context of computer networks, customers represent packets (or frames, and we shall not make the distinction here), and service represents the assignment of packets to communication links. For instance, if a link (server) has a bandwidth of B bps (service rate), then the service time for a packet (customer) assigned to that link will be L/B, where L is the size of the packet in bits (including headers if frame). Because the number of servers is usually finite, customers of this system are often modeled to be waiting for service in queues. Queuing theory is the field responsible for the study of such systems. The theory will help us gain some insight about buffer space, packet delays, and network utilization. This in turn could help us in the design of switching strategies (network layer) and congestion control mechanisms (e.g. TCP).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Introduction to Queuing Networks; E. Gelenbe, G. Pujolle

It is not an easy task to write a book on queuing networks when a large number of books in the topic have already been published. The authors have written a very timely book on queuing networks which can be used by people working in the area of communication networks. The basics of stochastic process have been discussed in Chapter 1 with queuing networks being introduced in Chapter 2 where the ...

متن کامل

Simulation of Reliability in Multi-server Computer Networks

-The performance in terms of reliability of multi-server computer networks motivates this paper. The probability limit theorem is derived on the virtual waiting time of job in nodes in a multi-server open queueing network and applied to a reliability model for multi-server computer networks where we relate the time of failure of a multi-server computer network to the system parameters. Key-Word...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008